A faster algorithm for a due date assignment problem with tardy jobs

Keywords: Single-machine sequencing Weighted number of tardy jobs Due date assignment a b s t r a c t The single-machine due date assignment problem with the weighted number of tardy jobs objective, (the TWNTD problem), and its generalization with resource allocation decisions and controllable job processing times have been solved in O(n 4) time by formulating and solving a series of assignment problems. In this note, a faster O(n 2) dynamic programming algorithm is proposed for the TWNTD problem and for its controllable processing times generalization in the case of a convex resource consumption function.